Automata Theory for Reasoning About Actions
نویسنده
چکیده
In this paper, we show decidabil i ty of a rather expressive fragment of the situation calculus. We allow second order quantif ication over finite and inf inite sets of situations. We do not impose a domain closure assumption on actions; therefore, infinite and even uncountable domains are allowed. The decision procedure is based on automata accepting infinite trees.
منابع مشابه
Improving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning
In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...
متن کاملAutomata : Enforcement Mechanisms for Run - time Security Policies ?
We analyze the space of security policies that can be enforced by monitoring and modifying programs at run time. Our program monitors, called edit automata, are abstract machines that examine the sequence of application program actions and transform the sequence when it deviates from a specified policy. Edit automata have a rich set of transformational powers: They may terminate the application...
متن کاملAutomata on Distributed Alphabets
Traditional automata theory is an extremely useful abstraction for reasoning about sequential computing devices. For distributed systems, however, there is no clear consensus on how best to incorporate various features such as spatial independence, concurrency and communication into a formal computational model. One appealing and elegant approach is to have a network of automata operating on a ...
متن کاملThe relationship between CSP, FDR and Büchi automata
Two long standing approaches to specifying and verifying properties of finite-state systems are Büchi automata, which are specialised for reasoning about infinite traces, and the combination of CSP and its refinement checker FDR, which offer some scope for reasoning about infinite traces in addition to capturing a wide variety of finitely observable behaviour. In this paper we demonstrate that ...
متن کاملTimed-Automata Based Model-Checking of a Multi-Agent System: A Case Study
A multi-agent based transport system is modeled by timed automata model extended with clock variables. The correctness properties of safety and liveness of this model are verified by timed automata based UPPAAL. Agents have a degree of control on their own actions, have their own threads of control, and under some circumstances they are also able to take decisions. Therefore they are autonomous...
متن کامل